15 research outputs found

    Investigative Support for Information Confidentiality Part II: Applications in Cryptanalysis and Digital Forensics

    Get PDF
    AbstractThis is Part II in a two-part series discussing the development of investigative support for information confidentiality. In Part I, we proposed a technique based on relation algebra to detect confidential information leakage via protocol-based covert channels. In this paper, we continue developing investigative support for information confidentiality. We examine the application of the technique for detecting confidential information leakage proposed in Part I in cryptanalysis and digital forensics to highlight its usefulness beyond the scope of covert channel analysis. By way of a short case study, we show the automation of the cryptanalysis application of the technique for detecting confidential information leakage using a prototype tool and a known-plaintext attack

    The JK System to Detect Plagiarism

    Get PDF
    In this research a system, referred to as Jubair-Khaireddin (JK), has been developed to assess the degree of similarity between two programs even though they look superficially dissimilar. The JK system has the capability to detect deliberate attempts of plagiarism. Reverse engineering technique is used to bring each suspected program back to its initial specification stage. This operation enables us to extract the structure of the program which is an important factor in detecting plagiarism. This can be achieved through the extraction of the Static Execution Tree (SET) for each program. The SET is then transformed into Terminating Binary Sequence (TBS). The TBSs generated from the tested programs are compared in order to get similar branches. Reengineering technique is then applied on these similar branches in order to compute its entropy (information content). The entropy is computed to prove or disprove the existence of similarities between programs. The JK system has been tested on different Java programs with different modifications, and proved successful in detecting almost all cases including those of partially plagiarised programs.Facultad de Informátic

    The JK System to Detect Plagiarism

    Get PDF
    In this research a system, referred to as Jubair-Khaireddin (JK), has been developed to assess the degree of similarity between two programs even though they look superficially dissimilar. The JK system has the capability to detect deliberate attempts of plagiarism. Reverse engineering technique is used to bring each suspected program back to its initial specification stage. This operation enables us to extract the structure of the program which is an important factor in detecting plagiarism. This can be achieved through the extraction of the Static Execution Tree (SET) for each program. The SET is then transformed into Terminating Binary Sequence (TBS). The TBSs generated from the tested programs are compared in order to get similar branches. Reengineering technique is then applied on these similar branches in order to compute its entropy (information content). The entropy is computed to prove or disprove the existence of similarities between programs. The JK system has been tested on different Java programs with different modifications, and proved successful in detecting almost all cases including those of partially plagiarised programs.Facultad de Informátic

    New graph coloring algorithms

    Get PDF
    Abstract: Two new heuristic graph-coloring algorithms, based on known heuristic algorithms, have been introduced. One of them is a modification of the Largest Degree Ordering (LDO) algorithm, and the other one is a modification of the Saturation Degree Ordering (SDO) algorithm. The two new algorithms proposed in this paper, were compared empirically, in terms of used colors, with some of the known heuristic graph-coloring algorithms such as: Largest Degree Ordering (LDO), First Fit (FF), Saturated Degree Ordering (SDO), and Incident Degree Ordering (IDO). As a result of this comparison, it was found that the proposed algorithms were better than the original ones with respect to the number of used colors
    corecore